IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, VOL. 26, NO. X,

Source URL: www.cs.uoi.gr

• Mathematics
• Operations research
• Computational complexity theory
• Combinatorics
• Combinatorial optimization
• NP-complete problems
• Set cover problem
• Greedy algorithm
• Heuristic
• Integer programming
• Matching
• Linear programming

Bonn Workshop on Combinatorial Optimization Friday, November 7th, 2008 Chair: George L. Nemhauser 09.00 – 09.30

Source URL: www.or.uni-bonn.de

Boolean Lexicographic Optimization Joao Marques-Silva1 , Josep Argelich2 , Ana Grac¸a3 , and Inˆes Lynce3 1 2 CSI/CASL, University College Dublin, Ireland

Source URL: ceur-ws.org

• Theoretical computer science
• Mathematics
• Mathematical optimization
• Numerical analysis
• Combinatorial optimization
• Operations research
• Constraint programming
• Logic in computer science
• Maximum satisfiability problem
• Linear programming
• Constrained optimization
• Solver

Anna Adamaszek, Andreas Wiese Tutorials: Marvin K¨ unnemann Summer 2014

Source URL: resources.mpi-inf.mpg.de

• Mathematics
• NP-complete problems
• Theory of computation
• Scheduling
• Theoretical computer science
• Combinatorial optimization
• Independent set
• Makespan
• Approximation algorithm
• Matching
• Operations research
• Truthful job scheduling

Introduction to Algorithms Massachusetts Institute of Technology Professors Erik Demaine, Piotr Indyk, and Manolis Kellis May 19, Spring 2011

Source URL: courses.csail.mit.edu

• Computational complexity theory
• Mathematics
• Theory of computation
• Analysis of algorithms
• Operations research
• Asymptotic analysis
• Combinatorial optimization
• Dynamic programming
• Master theorem
• Big O notation
• Knapsack problem
• Time complexity

Bonn Workshop on Combinatorial Optimization Thursday, November 6th, 2008 Chair: Peter Gritzmann 09.00 – 09.30

Source URL: www.or.uni-bonn.de

• Camaldolese Hermit Monastery
• Krakw

CS364B: Frontiers in Mechanism Design Lecture #10: Coverage Valuations and Convex Rounding∗ Tim Roughgarden† February 5, 2014

Source URL: theory.stanford.edu

• Mathematics
• Operations research
• Linear programming
• Combinatorial optimization
• Convex optimization
• Submodular set function
• Valuation
• Approximation algorithm
• Randomized rounding
• Ellipsoid method
• Mathematical optimization
• Algorithm

Online Bipartite Matching with Random Arrivals: An Approach Based on Strongly Factor-Revealing LPs ∗ Mohammad Mahdian

Source URL: www.qiqiyan.com.s3-website-us-east-1.amazonaws.com

• Mathematics
• Mathematical analysis
• Theory of computation
• Combinatorial optimization
• Matching
• Linear programming
• Approximation algorithm
• Permutation
• Measure theory
• operator

Algorithms and Data Structures Winter TermExercises for UnitIn a basketball tournament n teams play against each other (possibly multiple times) in a pre-determined sequence. The winner of a game gets one

Source URL: www-tcs.cs.uni-sb.de

• Graph theory
• Mathematics
• Network flow
• Graph connectivity
• Combinatorial optimization
• Routing algorithms
• Matching
• FordFulkerson algorithm
• Maximum flow problem
• Flow network
• Cut
• Graph

The Price of Anarchy for Minsum Related Machine Scheduling Ruben Hoeksma and Marc Uetz University of Twente, Dept. Applied Mathematics, P.O. Box 217, 7500AE Enschede, The Netherlands, {r.p.hoeksma, m.uetz}@utwente.nl

Source URL: dii.uchile.cl

• Game theory
• Price of anarchy
• Scheduling
• Mathematical optimization
• Operations research
• Combinatorial optimization
• Mathematics
• Job shop scheduling
• Mathematical analysis
• Job scheduling game